897. Increasing Order Search Tree - LeetCode Solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def increasingBST(self, root: TreeNode) -> TreeNode:
        k = []
        
    
        def trav(root):
            
            if not root:
                return 
            
            trav(root.left)
            k.append(root.val)
            
            
            
            trav(root.right)
        
        trav(root)
        
        j = TreeNode(0)
        
        def create(root, k):
            if not k:
                return 
            
            root.right = TreeNode(k.pop(0))
            
            create(root.right, k)
            
        
        create(j, k)
            
        return j.right